Logic Programming with General Clauses and Defaults Based on Model Elimination
نویسندگان
چکیده
The foundations of a class of logic programming systems wi th the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation method is an extended version of weak model el imination. The first ques t ion addressed is how to compute answers with weak model el iminat ion when queries and programs are sets of arbitrary clauses, which is completely settled by a soundness and completeness result. The ques t ion of comput ing only definite answers is also settled. Then, the problem of computing answers is rediscussed when the logic programs also include a finite set of defaults.
منابع مشابه
DP — A System for Reasoning with Supernormal Defaults
DP is a top-down theorem prover for supernormal or Poole-type defaults. Axioms and defaults can be arbitrary clauses, i.e. it supports disjunctions and (real) classical negation. Multiple disjunctions can be handled credulously, skeptically, and carefully. In skeptical mode, the expressivity of supernormal defaults corresponds to variable circumscription. The system is based on model eliminatio...
متن کاملConstraint Model Elimination and a PTTP-Implementation
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constraint processing into a general, non-Horn theorem proving calculus. A framework for a new calculus is introduced which combines model elimination with constraint solving, following the lines of Bürckert (1991). A prototy...
متن کاملLogic Program Specialisation With Deletion of Useless Clauses
In this paper we describe a method of program specialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. In the specialisation method, a partial evaluation of the proof procedure with respect to a given theory is rst obtained. Secondly an abstract interpretation of the partially evaluated program is computed, and this is...
متن کاملLogic Program Specialisation with Deletion of Useless Clauses 1
In this paper we describe a method of program specialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. In the specialisation method, a partial evaluation of the proof procedure with respect to a given theory is rst obtained. Secondly an abstract interpretation of the partially evaluated program is computed, and this is...
متن کاملSemantics of Inheritance in Logical Object Specifications
Our goal is to integrate the paradigms of object-oriented structuring and of rule-based specifications for databases. In this paper, we consider hierarchical specifications of objects and object types with attributes defined by logical rules, and we explain their local (single object) semantics as well as their composite (object society) semantics. In order to allow inheritance with exceptions ...
متن کامل